Design Related Investigations for Media Access Control Protocol Service Schemes in Wavelength Division Multiplexed All Optical Networks

All-optical networks (AON) are emerging through the technological advancement of various optical components, and promise to provide almost unlimited bandwidth. To realise true network utilisation, software solutions are required. An active area of research is media access control (MAC) protocol. This protocol should address the multiple channels by wavelength division mutiplexing (WDM) and bandwidth management. Token-passing (TP) is one such protocol, and is adopted due to its simplicity and collisionless nature. Previously, this protocol has been analysed for a single traffic type. However, such a study may not substantiate the protocol's acceptance in the AON design. As multiple traffic types hog the network through the introduction multimedia services and Internet, the MAC protocol should support this traffic. Four different priority schemes are proposed for TP protocol extension, and classified as static and dynamic schemes. Priority assignments are a priori in static scheme, whereas in the other scheme, priority reassignments are carried out dynamically. Three different versions of dynamic schemes are proposed. The schemes are investigated for performance through analytical modelling and simulations. The semi-Markov process (SMP) modelling approach is extended for the analyses of these cases. In this technique, the behaviour of a typical access node needs to be considered. The analytical results are compared with the simulation results. The deviations of the results are within the acceptable limits, indicating the applicability ofthe model in all-optical environment. It is seen that the static scheme offers higher priority traffic better delay and packet loss performance. Thus, this scheme can be used beneficially in hard real-time systems, where knowledge of priority is a priori. The dynamic priority scheme-l is more suitable for the environments where the lower priority traffic is near real-time traffic and loss sensitive too. For such a scheme, a larger buffer with smaller threshold limits resulted in improved performance. The dynamic scheme-2 and 3 can be employed to offer equal treatment for the different traffic types, and more beneficial in future AONs. These schemes are also compared in their performance to offer constant QoS level. New parameters to facilitate the comparison are proposed. It is observed that the dynamic scheme-l outperforms the other schemes, and these QoS parameters can be used for such QoS analysis. It is concluded that the research can benefit the design of the protocol and its service schemes needed in AON system and its applications

A token-passing variable buffer model for a double-layered hierarchical WDM all-optical network

Presents a hierarchical all-optical network, employing wavelength division multiplexing for multiple channel transmission. A double-layered network with multiple sub-network implementation which provides for spatial wavelength reuse is considered. The piggybacked token-passing medium access protocol as a fair and non-contentious access scheme is studied for performance. The average delay in getting access to the network medium is determined from the semi-Markov process. The performance of the protocol model design with variable buffer sizes of the transmitter is analysed. It is shown from the double-layered hierarchical network that alternative route for data transmission can be implemented to improve on performance

Design of simulation system for performance predictions of WDM single-hop networks

Describes the design, development and use of a software architecture for a simulation environment to examine, validate and predict the performance of piggybacked token passing protocol for a wavelength division multiplexed (WDM) optical network. This simulation environment overcomes many of the limitations found with analytical models. A set of the principal components and their dynamics, which make up the simulation design has been identified. It is shown that this protocol optimises the usage of the bandwidth available in the optical fibre with more than 70% used for data transmission. It is also suggested that the number of channels required to accomplish a single-hop connection within a local environment is small with number of channels to nodes ratio of 1:4. This is comparatively small and requires only limited-tuneable transceivers

A scheduling algorithm for WDM optical networks

This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. The algorithm is free from collision and supports a particular class of quality of service (QoS), namely constant bit rate (CBR). The running time complexity of the algorithm is O(Mlog2N)1, where M and N are the number of packets used for scheduling and the number of nodes, respectively. This running time can be improved to O(log3N) by parallel processing

An Energy-Efficient Clustering Algorithm for Multihop Data Gathering in Wireless Sensor Networks 1

Abstract—Wireless sensor networks afford a new opportunity to observe and interact with physical phenomena at an unprecedented fidelity. To fully realize this vision, these networks have to be self-organizing, selfhealing, economical and energy-efficient simultaneously. Since the communication task is a significant power consumer, there are various attempts to introduce energyawareness within the communication stack. Node clustering, to reduce direct transmission to the base station, is one such attempt to control energy dissipation for sensor data gathering. In this work, we propose an efficient dynamic clustering algorithm to achieve a network-wide energy reduction in a multihop context. We also present a realistic energy dissipation model based on the results from stochastic geometry to accurately quantify energy consumption employing the proposed clustering algorithm for various sensor node densities, network areas and transceiver properties. Index Terms—data gathering, clustering, energy efficient, stochastic geometry, wireless sensor network I

A configurable time-controlled clustering algorithm for wireless sensor networks

Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena in real time. These nodes are typically highly resource-constrained. Since the communication task is a significant power consumer, there are various attempts to introduce energy awareness at different levels within the communication stack. Clustering is one such attempt to control energy dissipation for sensor data routing. Here, we propose the Time-Controlled Clustering Algorithm to realise a network-wide energy reduction by the rotation of clusterhead role, and the consideration of residual energy in its election. A realistic energy model is derived to accurately quantify the network's energy consumption using the proposed clustering algorithm

An energy-efficient clustering algorithm for multihop data gathering in wireless sensor networks

Wireless sensor networks afford a new opportunity to observe and interact with physical phenomena at an unprecedented fidelity. To fully realize this vision, these networks have to be self-organizing, self-healing, economical and energy-efficient simultaneously. Since the communication task is a significant power consumer, there are various attempts to introduce energy-awareness within the communication stack. Node clustering, to reduce direct transmission to the base station, is one such attempt to control energy dissipation for sensor data gathering. In this work, we propose an efficient dynamic clustering algorithm to achieve a network-wide energy reduction in a multihop context. We also present a realistic energy dissipation model based on the results from stochastic geometry to accurately quantify energy consumption employing the proposed clustering algorithm for various sensor node densities, network areas and transceiver properties